Concept for a Genetic Algorithm for Packing Three Dimensional Objects of Com- plex Shape
نویسندگان
چکیده
In this paper we describe a concept and a research project under way to develop a packing method for three dimensional objects of complex shape. Selective Laser Sintering (SLS) is a rapid prototyping (RP) technology which allows manufacturing of three dimensional objects directly from a solid CAD model by sintering fine plastic or metal powder in thin layers. When more than one part is to be manufactured at the same time, an operator has to build a batch out of CAD files making sure that parts do not intersect each other, they are totally inside the build cylinder and all other constraints are satisfied. This packing problem has several features which make it different from classical bin packing problems or other similar problems studied so far: (i) there are no restrictions on part shape or orientation, (ii) smaller parts can be built inside cavities of larger parts and (iii) no part is required to be underneath a part to provide support (parts “float” in powder). Developed packing algorithm is based on a genetic algorithm (GA) search. An order–based two dimensional chromosome represents both, the order and orientation of parts to be packed. Part geometries are included in the decoder which simulates the packing in order to evaluate each individual’s fitness. Packing schemes violating hard and soft constrains are penalized to reduce their fitness evaluation.
منابع مشابه
Aerodynamic Design Optimization Using Genetic Algorithm (RESEARCH NOTE)
An efficient formulation for the robust shape optimization of aerodynamic objects is introduced in this paper. The formulation has three essential features. First, an Euler solver based on a second-order Godunov scheme is used for the flow calculations. Second, a genetic algorithm with binary number encoding is implemented for the optimization procedure. The third ingredient of the procedure is...
متن کاملExtending Two-Dimensional Bin Packing Problem: Consideration of Priority for Items
In this paper a two-dimensional non-oriented guillotine bin packing problem is studied when items have different priorities. Our objective is to maximize the total profit which is total revenues minus costs of used bins and wasted area. A genetic algorithm is developed to solve this problem where a new coding scheme is introduced. To evaluate the performance of the proposed GA, first an upper b...
متن کاملcc sd - 0 00 00 57 7 ( v er si on 4 ) : 1 6 Ja n 20 04 Three - dimensional bubble clusters : shape , packing and growth - rate
We consider three-dimensional clusters of equal-volume bubbles packed around a central bubble and calculate their energy and optimal shape. We obtain the surface area and bubble pressures to improve on existing growth laws for three-dimensional bubble clusters. We discuss the possible number of bubbles that can be packed around a central one: the " kissing problem " , here adapted to deformable...
متن کاملRegular three-dimensional bubble clusters: shape, packing and growth-rate
We consider three-dimensional clusters of equal-volume bubbles packed around a central bubble and calculate their energy and optimal shape. We obtain the surface area and bubble pressures to improve on existing growth laws for three-dimensional bubble clusters. We discuss the possible number of bubbles that can be packed around a central one: the “kissing problem”, here adapted to deformable ob...
متن کاملA Comparative Study of Exact Algorithms for the Two Dimensional Strip Packing Problem
In this paper we consider a two dimensional strip packing problem. The problem consists of packing a set of rectangular items in one strip of width W and infinite height. They must be packed without overlapping, parallel to the edge of the strip and we assume that the items are oriented, i.e. they cannot be rotated. To solve this problem, we use three exact methods: a branch and bound method, a...
متن کامل